Large Graph Visualization by Hierarchical Clustering
نویسندگان
چکیده
منابع مشابه
Hierarchical clustering for graph visualization
This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملIntelligent Clustering for Graph Visualization
More and more areas use graphs for the representation of their data because it gives a connection-oriented perspective. Unfortunately, datasets are constantly growing in size, while devices have increasingly smaller screens (tablets, smartphones, etc). In order to reduce the quantity of elements displayed on screen, several techniques of information reduction can be used. Among them is graph cl...
متن کاملGraph-Based Hierarchical Conceptual Clustering
Hierarchical conceptual clustering has proven to be a useful, although under-explored, data mining technique. A graph-based representation of structural information combined with a substructure discovery technique has been shown to be successful in knowledge discovery. The SUBDUE substructure discovery system provides one such combination of approaches. This work presents SUBDUE and the develop...
متن کاملTitle: Graph-based Hierarchical Conceptual Clustering Graph-based Hierarchical Conceptual Clustering
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graphbased representation of structural information has been shown to be successful in knowledge discovery. The Subdue substructure discovery system provides the advantages of both approaches. In this paper we present Subdue and focus on its clustering capabilities. We use two examples to illustrate the val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2008
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2008.01933